Crypto Mark Scheme for Fast Pollution Detection and Resistance over Networking
نویسنده
چکیده
1 Assistant Professor, Department of Computer science and Engineering, V.S.B Engineering College, Karur, Tamilnadu India ---------------------------------------------------------------------***--------------------------------------------------------------------Abstract : Data security and data protection against pollution attacks with resource efficiency are the major challenging tasks of networks. Packet dropping and modifications are also common attacks that can be launched by an adversary to disrupt communication in networks. Many schemes have been proposed to mitigate, prevent those attacks. But very few can efficiently identify the pollution attackers with the delay and cost considerations. Even those schemes could find after the attacks done. Those type of schemes used packet HOP_VOTE techniques to investigate and verify the security issue .To address these issues, the proposed system introduces a simple and powerful scheme. The scheme which is a rapid identifier of polluters and this helps to identify misbehaved data and routes that dropped or modified packets. And this proposed system also considers the other type of security issues such as pollution attacks, packet content modification and packet dropping attacks. In order to identify and prevent the data from unauthorized forwarders, the system proposed a new scheme which is named as HOPVOTE The proposed system utilizes the HOPVOTE which is an efficient packet HOPVOTE technique to protect, prevent and avoid routing misbehaving attacks. In order to identify and block the nodes which tries to drop or modify the data, the proposed system has been implemented the Keybit verification algorithm. The proposed system also recovers the data which are polluted and retransmits using cache based recovery concept. The procedure behind the proposed system is to identify the key and its value of every packet with secured data transmission.
منابع مشابه
Software-Defined Networking-based Crypto Ransomware Detection Using HTTP Traffic Characteristics
Ransomware is currently the key threat for individual as well as corporate Internet users. Especially dangerous is crypto ransomware that encrypts important user data and it is only possible to recover it once a ransom has been paid. Therefore devising efficient and effective countermeasures is a rising necessity. In this paper we present a novel Software-Defined Networking (SDN) based detectio...
متن کاملافروزش سریع- شوکی رهیافتی نوین برای همجوشی محصور سازی اینرسی
A new concept for inertial confinement fusion called fast-shock ignition (FSI) is introduced as a credible scheme in order to obtain high target gain. In the proposed model, the separation of fuel ignition into two successive steps, under the suitable conditions, reduces required ignitor energy for the fuel ignition. The main procedure in FSI concept is compressing the fuel up to stagnation. T...
متن کاملContinuous Collision Resistance and its Applications
We introduce a new, simple and non-interactive complexity assumption for cryptographic hash functions, which seems very reasonable for standard functions like SHA-3. We describe how this assumption can be leveraged to obtain standard-model constructions that previously seemed to require a programmable random oracle: a generic construction of identity-based key encapsulation (ID-KEM) with full a...
متن کاملProtection Scheme of Power Transformer Based on Time–Frequency Analysis and KSIR-SSVM
The aim of this paper is to extend a hybrid protection plan for Power Transformer (PT) based on MRA-KSIR-SSVM. This paper offers a new scheme for protection of power transformers to distinguish internal faults from inrush currents. Some significant characteristics of differential currents in the real PT operating circumstances are extracted. In this paper, Multi Resolution Analysis (MRA) is use...
متن کاملCrypto-analyses on "user efficient recoverable off-line e-cashs scheme with fast anonymity revoking"
Recently, Fan et al. proposed a user efficient recoverable off-line e-cash scheme with fast anonymity revoking. They claimed that their scheme could achieve security requirements of an e-cash system such as, anonymity, unlinkability, double spending checking, anonymity control, and rapid anonymity revoking on double spending. They further formally prove the unlinkability and the un-forgeability...
متن کامل